Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
نویسندگان
چکیده
منابع مشابه
Machine Learning Predicting nearly as well as the best pruning of a decision tree
Many algorithms for inferring a decision tree from data involve a two phase process First a very large decision tree is grown which typically ends up over tting the data To reduce over tting in the second phase the tree is pruned using one of a number of available methods The nal tree is then output and used for classi cation on test data In this paper we suggest an alternative approach to the ...
متن کاملPredicting Nearly as well as the best Pruning of a Planar Decision Graph
We design efficient on-line algorithms that predict nearly as well as the best pruning of a planar decision graph. We assume that the graph has no cycles. As in the previous work on decision trees, we implicitly maintain one weight for each of the prunings (exponentially many). The method works for a large class of algorithms that update its weights multiplicatively. It can also be used to desi...
متن کاملPredicting Nearly As Well As the Optimal Twice Differentiable Regressor
We investigate the problem of sequential piecewise linear regression from a competitive framework. For an arbitrary and unknown data length n, we first introduce a method to partition the regressor space. Particularly, we present a recursive method that divides the regressor space into O(n) disjoint regions (partitions) that can result in approximately 1.5 different piecewise linear models on t...
متن کاملthe effect of lexical and grammatical collocation instruction through input flooding versus awareness raising on short-term and delayed retention as well a active use
this study attempted to explore if teaching english collocations through two different modes of awareness-raising and input flooding has any possible differential effect on immediate retention as well as retention in a delayed assessment. it also compared the possible differential effect of teaching english collocations implicitly and explicitly on actively using the items in writing. m...
15 صفحه اولDecision Tree Pruning as a Search in the State Space
This paper presents a study of one particular problem of decision tree induction, namely (post-)pnming, with the aim of finding acommon framework for the plethora of pruning methods appeared in literature. Given a tree Tm~ to prune, a state space is defined as the set of all subtrees o f T to which only one operator, called any-depth branch pruning operator, can be applied in several ways in or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00138-9